An upper bound for conforming Delaunay triangulations
نویسندگان
چکیده
منابع مشابه
An Optimal Bound for High-Quality Conforming Triangulations
This paper shows that for any plane geometric graph G with n vertices there exists a triangulation T that conforms to G i e each edge of G is the union of some edges of T where T has O n vertices with each angle of its triangles measuring no more than Additionally T can be computed in O n log n time
متن کاملEncoding and Decoding of Planar Maps through Conforming Delaunay Triangulations
This paper describes a method to represent a Planar Map (PM) through a Conforming Delaunay Triangulation (CDT) with applications in a server-client environment. At the server a CDT of the edges of the PM is determined. As the PM is now embedded by the CDT it is sufficient to send to the client the list of coordinates of the CDT nodes and an efficient encoded bitmap of the corresponding PM-CDT e...
متن کاملAn upper bound for the number of planar lattice triangulations
We prove an exponential upper bound for the number f(m,n) of all maximal triangulations of the m × n grid: f(m,n) < 2. In particular, this improves a result of S. Yu. Orevkov [1]. We consider lattice polygons P (with vertices in Z), for example the convex hull of the grid Pm,n := {0, 1, . . . , m} × {0, 1, . . . , n}. We want to estimate the number of maximal lattice triangulations of P , i.e.,...
متن کاملUpper and Lower Bounds for Online Routing on Delaunay Triangulations
Consider a weighted graph G whose vertices are points in the plane and edges are line segments between pairs of points whose weight is the Euclidean distance between its endpoints. A routing algorithm on G sends a message from any vertex s to any vertex t in G. The algorithm has a competitive ratio of c if the length of the path taken by the message is at most c times the length of the shortest...
متن کاملAdaptive Finite Element Methods for Elliptic PDEs Based on Conforming Centroidal Voronoi-Delaunay Triangulations
A new triangular mesh adaptivity algorithm for elliptic PDEs that combines a posteriori error estimation with centroidal Voronoi/Delaunay tessellations of domains in two dimensions is proposed and tested. The ability of the first ingredient to detect local regions of large error and the ability of the second ingredient to generate superior unstructured grids results in an mesh adaptivity algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1993
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02573974